About kasikorn business-technology group [kbtg]
kasikorn business-technology group [kbtg] Interview Questions and Answers
Updated 21 Feb 2026No interview experiences shared yet.
View all interview questionsFrequently Asked Questions in kasikorn business-technology group [kbtg]
Have a question about the hiring process, company policies, or work environment? Ask the community or browse existing questions here.
Common Interview Questions in kasikorn business-technology group [kbtg]
Q: In a sports contest there were m medals awarded on n successive days (n > 1). 1. On the first day 1 medal and 1/7 of the remaining m - 1 medals were awarded. 2. On the second day 2 medals and 1/7 of the now remaining medals was awarded; and so on.On the nth and last day, the remaining n medals were awarded.How many days did the contest last, and how many medals were awarded altogether?
Q: A man has a wolf, a goat, and a cabbage. He must cross a river with the two animals and the cabbage. There is a small rowing-boat, in which he can take only one thing with him at a time. If, however, the wolf and the goat are left alone, the wolf will eat the goat. If the goat and the cabbage are left alone, the goat will eat the cabbage. How can the man get across the river with the two animals and the cabbage?
Q: A hare and a tortoise have a race along a circle of 100 yards diameter. The tortoise goes in one directionand the hare in the other. The hare starts after the tortoise has covered 1/5 of its distance and that too leisurely.The hare and tortoise meet when the hare has covered only 1/8 of the distance. By what factor should the hareincrease its speed so as to tie the race?
Q: Suppose a newly-born pair of rabbits, one male, one female, are put in a field. Rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits. Suppose that our rabbits never die and that the female always produces one new pair (one male, one female) every month from the second month on.
Q: Consider a pile of Diamonds on a table. A thief enters and steals 1/2 of the total quantity and then again 2 extra from the remaining. After some time a second thief enters and steals 1/2 of the remaining+2. Then 3rd thief enters and steals 1/2 of the remaining+2. Then 4th thief enters and steals 1/2 of the remaining+2. When the 5th one enters he finds 1 diamond on the table. Find out the total no. of diamonds originally on the table before the 1st thief entered.
Q: 36 people {a1, a2, ..., a36} meet and shake hands in a circular fashion. In other words, there are totally 36 handshakes involving the pairs, {a1, a2}, {a2, a3}, ..., {a35, a36}, {a36, a1}. Then size of the smallest set of people such that the res...
Q: T, U, V are 3 friends digging groups in fields. If T & U can complete i groove in 4 days &, U & V can complete 1 groove in 3 days & V & T can complete in 2 days. Find how many days each takes to complete 1 groove individually.
Q: The citizens of planet nigiet are 8 fingered and have thus developed their decimal system in base 8. A certain street in nigiet contains 1000 (in base 8) buildings numbered 1 to 1000. How many 3s are used in numbering these buildings?
Q: A light bulb is hanging in a room. Outside of the room there are three switches, of which only one is connected to the lamp. In the starting situation, all switches are 'off' and the bulb is not lit. If it is allowed to check in the room only once.How would you know which is the switch?
Q: At 6?o a clock ticks 6 times.The time between first and last ticks is 30 seconds.How long does it tick at 12?o clock?2.A hotel has 10 storey. Which floor is above the floor below the floor, below the floor above the floor, below the floor above the fifth.
Q: A long, long time ago, two Egyptian camel drivers were fighting for the hand of the daughter of the sheik of Abbudzjabbu. The sheik, who liked neither of these men to become the future husband of his daughter, came up with a clever plan: a race would dete
Q: Jarius and Kylar are playing the game. If Jarius wins, then he wins twice as many games as Kylar. If Jarius loses, then Kylar wins as the same number of games that Jarius wins. How many do Jarius and Kylar play before this match?
Q: In a Park, N persons stand on the circumference of a circle at distinct points. Each possible pair of persons, not standing next to each other, sings a two-minute song ? one pair immediately after the other. If the total time taken for singing is 28 minutes, what is N?
Q: If I walk with 30 miles/hr i reach 1 hour before and if i walk with 20 miles/hr i reach 1 hour late. Find the distance between 2 points and the exact time of reaching destination is 11 am then find the speed with which it walks.
Q: Given a collection of points P in the plane , a 1-set is a point in P that can be separated from the rest by a line, .i.e the point lies on one side of the line while the others lie on the other side. The number of 1-sets of P is denoted by n1(P)....
Q: An escalator is descending at constant speed. A walks down and takes 50 steps to reach the bottom. B runs down and takes 90 steps in the same time as A takes 10 steps. How many steps are visible when the escalator is not operating.Â
Q: A family X went for a vacation. Unfortunately it rained for 13 days when they were there. But whenever it rained in the mornings, they had clear afternoons and vice versa. In all they enjoyed 11 mornings and 12 afternoons. How many days did they stay there totally?
Q: There are some chickens in a poultry. They are fed with corn. One sack of corn will come for 9 days. The farmer decides to sell some chickens and wanted to hold 12 chicken with him. He cuts the feed by 10% and sack of corn comes for 30...
Q: Motorboat A leaves shore P as B leaves Q; they move across the lake at a constant speed. They meet first time 600 yards from P. Each returns from the opposite shore without halting, and they meet 200 yards from. How long is the lake?
Q: In mathematics country 1,2,3,4....,8,9 are nine cities. Cities which form a no. that is divisible by 3 are connected by air planes. (e.g. cities 1 & 2 form no. 12 which divisible by 3 then 1 is connected to city 2). Find the total no. of ways you can go to 8 if you are allowed to break the journeys.